method identifi featur constraint base featur select mine creat nest map clio deadlin qo awar data warehous network dbase problem detect distribut system algorithm find attribut group binari segment categor databas mine structur associ pattern databas mine optim associ rule numer attribut huge databas address problem find associ rule numer attribut balanc cardloan impli bank custom balanc fall rang card loan probabl greater rule interest rang special featur respect interrel balanc cardloan requir number custom balanc contain call support suffici probabl call confid raho higher averag probabl condit met goal realiz system find rang automat focu comput parallel process multipl aggreg queri share dnoth multiprocessor algorithm mine associ rule binari segment huge categor databas problem find associ rule make optim binari segmen tation huge categor databas op timal segment defin ob jectiv function suitabl user objec tive object function defin term distribut target attribut goal find associ rule split databas subset optimiz ing object function problem intract gener ob jectiv function let number record databas binari segment exhaust examin object function convex feasibl algorithm find optim binari segment prove typic criteria entropi mutual inform correla tion gini index squar error convex propos practic algorithm comput geometri techniqu handl comput optim rectilinear region associ rule interv find applic data mine mine optim associ rule numer attribut huge databas address problem find associ rule numer attribut balanc cardloan impli bank custom balanc fall rang card loan probabl greater rule interest rang special featur respect interrel balanc cardloan requir number custom balanc contain call support suffici probabl call confid raho higher averag probabl condit met goal realiz system find rang automat focu comput data mine ddimension optim accoci rule scheme sonar system optim numer associationrul propos extens entropi base heurist quinlan construct decis tree larg databas numer attribut quinlan point origin method exist method ineffici numer attribut strongli correl approach offer solut problem pair numer attribut strong correl comput dimension associ rule respect attribut object attribut decis tree famili grid region plane pair attribut data split class data insid data comput region opt minim entropi split add split opt pair strongli correl attribut set candid test quinlan entropi base heurist give effici alg construct effici decis tree optim numer associ rule propos extens entropi base heurist quinlan construct decis tree larg databas numer attribut quinlan point origin method exist method ineffici numer attribut strongli correl approach offer solut problem pair numer attribut strong correl comput dimension associ rule respect attribut object attribut decis tree famili grid region plane pair attribut data split class data insid data comput region opt minim entropi split add split opt pair strongli correl attribut set candid test quinlan entropi base heurist give effici alg 